The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(INF, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

inc(Cons(x, xs)) → Cons(Cons(Nil, Nil), inc(xs))
nestinc(Nil) → number17(Nil)
nestinc(Cons(x, xs)) → nestinc(inc(Cons(x, xs)))
inc(Nil) → Cons(Nil, Nil)
number17(x) → Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Cons(Nil, Nil)))))))))))))))))
goal(x) → nestinc(x)

Rewrite Strategy: INNERMOST

(1) InfiniteLowerBoundProof (EQUIVALENT transformation)

The loop following loop proves infinite runtime complexity:
The rewrite sequence
nestinc(Cons(x, xs)) →⁺ nestinc(Cons(Cons(Nil, Nil), inc(xs)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [ ].
The result substitution is [x / Cons(Nil, Nil), xs / inc(xs)].

(2) BOUNDS(INF, INF)